Subgraphs, closures and hamiltonicity
نویسندگان
چکیده
منابع مشابه
Subgraphs, Closures and Hamiltonicity
Closure theorems in hamiltonian graph theory are of the following type: Let G be a 2connected graph and let II, u be two distinct nonadjacent vertices of G. If condition c(u, u) holds, then G is hamiltonian if and only if G + MU is hamiltonian. We discuss several results of this type in which u and v are vertices of a subgraph H of G on four vertices and c(u, u) is a condition on the neighborho...
متن کاملForbidden subgraphs, stability and hamiltonicity
We study the stability of some classes of claw-free graphs deened in terms of forbidden subgraphs under the closure operation deened in 10]. We characterize all connected graphs A such that the class of all CA-free graphs (where C denotes the claw) is stable. Using this result, we prove that every 2-connected and CHP 8-free, CHZ 5-free or CHN 1;1;4-free graph is either hamiltonian or belongs to...
متن کاملHamiltonicity and forbidden subgraphs in 4-connected graphs
Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3, 1, 1, 1, 1, 1), i.e. T is a chain of three triangles. We show that every 4-connected {T,K1,3}-free graph has a hamiltonian cycle.
متن کاملForbidden subgraphs, hamiltonicity and closure in claw-free graphs
We study the stability of some classes of graphs deened in terms of forbidden sub-graphs under the closure operation introduced by the second author. Using these results, we prove that every 2-connected claw-free and P 7-free, or claw-free and Z 4-free, or claw-free and eiiel-free graph is either hamiltonian or belongs to a certain class of exceptions (all of them having connectivity 2).
متن کاملPairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
Let G be a graph on n vertices. An induced subgraph H of G is called heavy if there exist two nonadjacent vertices in H with degree sum at least n in G. We say that G is H-heavy if every induced subgraph of G isomorphic to H is heavy. For a family H of graphs, G is called H-heavy if G is H-heavy for every H ∈ H. In this paper we characterize all connected graphs R and S other than P3 (the path ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90092-2